On the approximation of a convex body by its radial mean bodies
نویسندگان
چکیده
In this paper, we consider the approximation problem on the volume of a convex body K in Rn by those of its radial mean bodies RpK. Specifically, we establish the identity lim p→∞ p log p (1− 2−n |Rp(K)| |K| ) = n(n+ 1) 2 , when K is an ellipsoid in Rn. c ©2016 All rights reserved.
منابع مشابه
Numerical simulation of Laminar Free Convection Heat Transfer around Isothermal Concave and Convex Body Shapes
In the present research, free convection heat transfer from isothermal concave and convex body shapes is studied numerically. The body shapes investigated here, are bi-sphere, cylinder, prolate and cylinder with hemispherical ends; besides, they have the same height over width (H/D = 2). A Numerical simulation is implemented to obtain heat transfer and fluid flow from all of the geometries in a...
متن کاملOn Analysis of Stress Concentration in Curvilinear Anisotropic Deformable Continuum Bodies
In cylindrical continua, hoop stresses are induced due to the circumferential failure. This mainly happens when the cylinder is subjected to mechanical loads which vary in the circumferential directions. On the other hand, radial stress is stress in the direction of or opposite to the central axis of a cylindrical body. In the present study, the influence of curvilinear anisotropy on the radial...
متن کاملApproximation of Smooth Convex Bodies by Random Circumscribed Polytopes
Choose n independent random points on the boundary of a convex body K ⊂Rd . The intersection of the supporting halfspaces at these random points is a random convex polyhedron. The expectations of its volume, its surface area and its mean width are investigated. In the case that the boundary of K is sufficiently smooth, asymptotic expansions as n→∞ are derived even in the case when the curvature...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملOn the approximation of a polytope by its dual L p - centroid bodies ∗
We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P ∈ R by its dual Lp-centroid bodies is independent of the geometry of P . In particular we show that if P has volume 1, lim p→∞ p log p „ |Z◦ p (P )| |P ◦| − 1 « = n. We provide an application to the approximation of polytopes by uniformly convex sets.
متن کامل